Message integrity of IAPM and IACBC

Jutla [1] g a ve two s hemes to ombine message integrity with en ryption. The methods use a blo kipher as the main ingredient. To analyze these s hemes we repla e the blo k en ryption by a random permutation and analyze the onstru tion in an information theoreti way. The rationale behind this is that a g o o d blo k ipher should b e a pseudorandom permutation and thus for an atta ker that does not know the key the real situation is omputationally indistinguishable from the situation des ribed above. Note that this is a preliminary paper and in the full paper we will have a more omplete introdu tion whi h also ompares to related work.